Possibilistic Information Fusion Using Maximal Coherent Subsets

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Possibilistic and Probabilistic Information Fusion

This article discusses the basic features of information provided in terms of possibilistic uncertainty. It points out the entailment principle, a tool that allows one to infer less specific from a given piece of information. The problem of fusing multiple pieces of possibilistic information is and the basic features of probabilistic information are described. The authors detail a procedure for...

متن کامل

Squibs: Maximal Consistent Subsets

Default unification operations combine strict information with information from one or more defeasible feature structures. Many such operations require finding the maximal subsets of a set of atomic constraints that are consistent with each other and with the strict feature structure, where a subset is maximally consistent with respect to the subsumption ordering if no constraint can be added t...

متن کامل

Maximal Consistent Subsets

Default unification operations combine strict information with information from one or more defeasible feature structures. Many such operations require finding the maximal subsets of a set of atomic constraints which are consistent with each other and with the strict feature structure, where a subset is maximally consistent with respect to the subsumption ordering if no constraint can be added ...

متن کامل

Towards Using Possibilistic Information Flow Control

We show how security requirements, in particular confidentiality requirements, for a whole multiagent system can formally be decomposed into confidentiality requirements for the agents. The decomposition assumes that there is some control over, or trust in, a subset of the agents and that the platform is trusted to satisfy certain reasonable assumptions. It is generic over the internal executio...

متن کامل

Ontology-Driven Possibilistic Reference Fusion

It often happens that different references (i.e. data descriptions), possibly coming from different heterogeneous data sources, concern the same real world entity. In such cases, it is necessary: (i) to detect, through reconciliation methods, whether different data descriptions refer to the same real world entity and (ii) to fuse them into a unique representation. Here we assume the reference r...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Fuzzy Systems

سال: 2009

ISSN: 1063-6706,1941-0034

DOI: 10.1109/tfuzz.2008.2005731